Confluence of Non-Left-Linear TRSs via Relative Termination
نویسندگان
چکیده
We present a confluence criterion for term rewrite systems by relaxing termination requirements of Knuth and Bendix’ confluence criterion, using joinability of extended critical pairs. Because computation of extended critical pairs requires equational unification, which is undecidable, we give a sufficient condition for testing joinability automatically.
منابع مشابه
Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
The decreasing diagrams technique (van Oostrom, 1994) has been successfully used to prove confluence of rewrite systems in various ways; using rule-labelling (van Oostrom, 2008), it can also be applied directly to prove confluence of some linear term rewriting systems (TRSs) automatically. Some efforts for extending the rule-labelling are known, but non-left-linear TRSs are left beyond the scop...
متن کاملConditional Rewrite Rules: Confluence and Termination
Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. Here we consider rewrite rules with conditions, such as they arise, e.g., from algebraic specifications with positive conditional equations. The conditional term rewriting systems thus obtained which we will study, are based upon the well-known class of left-linear, nonambiguous TRSs. A large part o...
متن کاملNon - E - overlapping and weakly shallow TRSs are confluent ( Extended abstract ) Masahiko Sakai
Confluence of term rewriting systems (TRSs) is undecidable, even for flat TRSs [MOJ06] or length-two string rewrite systems [SW08]. Two decidable subclasses are known: right-linear and shallow TRSs by tree automata techniques [GT05] and terminating TRSs [KB70]. Most of sufficient conditions are for either terminating TRSs [KB70] (extended to TRSs with relative termination [HA11, KH12]) or leftl...
متن کاملA Transformational Approach to Prove Outermost Termination Automatically
We present transformations from a generalized form of left-linear TRSs, called quasi left-linear TRSs, to TRSs such that outermost termination of the original TRS can be concluded from termination of the transformed TRS. In this way we can apply state-of-the-art termination tools for automatically proving outermost termination of any given quasi left-linear TRS. Experiments show that this works...
متن کاملSome Classes of Term Rewriting Systems for which Termination is Decidable
Termination is one of the central properties of term rewriting systems (TRSs for short). A TRS is called terminating if it does not admit any infinite rewrite sequence. The efforts to find classes of TRSs whose termination is decidable have been made for decades and several positive results have been proposed, for example, right-ground TRSs and right-linear shallow TRSs. In this research, we st...
متن کامل